Solve the split equality problem by a projection algorithm with inertial effects
نویسندگان
چکیده
منابع مشابه
Solve the split equality problem by a projection algorithm with inertial effects
The split equality problem has wide applicability in many fields of applied mathematics. In this paper, by using the inertial extrapolation, we introduce an inertial projection algorithm for solving the split equality problem. The weak convergence of the proposed algorithm is shown. Finally, we present a numerical example to illustrate the efficiency of the inertial projection algorithm. c ©201...
متن کاملA Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem
This paper deals with the split feasibility problem that requires to find a point closest to a closed convex set in one space such that its image under a linear transformation will be closest to another closed convex set in the image space. By combining perturbed strategy with inertial technique, we construct an inertial perturbed projection algorithm for solving the split feasibility problem. ...
متن کاملAn algorithm for the split-feasibility problems with application to the split-equality problem
In this paper, we study the split-feasibility problem in Hilbert spaces by using the projected reflected gradient algorithm. As applications, we study the convex linear inverse problem and the split-equality problem in Hilbert spaces, and we give new algorithms for these problems. Finally, numerical results are given for our main results.
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولModified Projection Algorithms for Solving the Split Equality Problems
The split equality problem (SEP) has extraordinary utility and broad applicability in many areas of applied mathematics. Recently, Byrne and Moudafi (2013) proposed a CQ algorithm for solving it. In this paper, we propose a modification for the CQ algorithm, which computes the stepsize adaptively and performs an additional projection step onto two half-spaces in each iteration. We further propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Nonlinear Sciences and Applications
سال: 2017
ISSN: 2008-1898,2008-1901
DOI: 10.22436/jnsa.010.03.33